package leetcode.code0335;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution335 implements IDebug {

	public abstract boolean isSelfCrossing(int[] distance);

	@Override
	public void debug1() {
		String str = "[2,1,1,2]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[1,2,3,4]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = false;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		String str = "[1,1,1,1]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug4() {
		String str = "[1,1,2,1,1]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}
	public void debug5() {
		String str = "[1,1,2,2,1,1]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}
	public void debug6() {
		String str = "[2,1,4,4,3,3,2,1,1]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}
	public void debug7() {
		String str = "[3,3,3,2,1,1]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = false;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}
	public void debug8() {
		String str = "[2,2,3,3,2,2]";
		int[] distance = HelpDebug.str2array3(str);
		boolean e = true;
		boolean r = this.isSelfCrossing(distance);
		HelpDebug.compare(e, r);
	}

}
